A 3D Sequential Thinning Scheme Based on Critical Kernels
نویسندگان
چکیده
We propose a new generic sequential thinning scheme based on the critical kernels framework. From this scheme, we derive sequential algorithms for obtaining ultimate skeletons and curve skeletons. We prove some properties of these algorithms, and we provide the results of a quantitative evaluation that compares our algorithm for curve skeletons with both sequential and parallel ones.
منابع مشابه
A New 3D Parallel Thinning Scheme Based on Critical Kernels
Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of this framework, and we derive a general methodology for designing parallel algorithms for skeletons of objects in 3D grids. In fact, this methodology does not need to handle the structure of abstract complexes, ...
متن کاملA Parallel Thinning Algorithm for Grayscale Images
Grayscale skeletonization offers an interesting alternative to traditional skeletonization following a binarization. It is well known that parallel algorithms for skeletonization outperform sequential ones in terms of quality of results, yet no general and well defined framework has been proposed until now for parallel grayscale thinning. We introduce in this paper a parallel thinning algorithm...
متن کاملNew 2D Parallel Thinning Algorithms Based on Critical Kernels
Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. In this context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, ...
متن کاملAsymmetric parallel 3D thinning scheme and algorithms based on isthmuses
Critical kernels constitute a general framework settled in the context of abstract complexes for the study of parallel thinning in any dimension. We take advantage of the properties of this framework, to propose a generic thinning scheme for obtaining “thin” skeletons from objects made of voxels. From this scheme, we derive algorithms that produce curve or surface skeletons, based on the notion...
متن کاملNew characterizations, in the framework of critical kernels, of 2D, 3D and 4D minimal non-simple sets and P-simple points
Critical kernels constitute a general framework in the category of abstract complexes for the study of parallel homotopic thinning in any dimension. In this article, we present new results linking critical kernels to minimal nonsimple sets (MNS) and P-simple points, which are notions conceived to study parallel thinning in discrete grids. We show that these two previously introduced notions can...
متن کامل